#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+6;

int q[N], n, k;

int main(){
    scanf("%d %d", &n, &k);
    
    for(int i = 0; i < n; i++) scanf("%d", &q[i]);
    
    while(k--){ 
        int x;
            
        scanf("%d", &x);
        
        int l = 0, r = n - 1;
        
        while(l < r){
            int mid = l + r >> 1;
            
            if(q[mid] >= x) r = mid;
            else l = mid + 1;
        }
        
        if(q[l] != x) printf("-1 -1\n");
        else{
            printf("%d ", l);
            
            int l = 0, r = n - 1;
            
            while(l < r){
                int mid = l + r + 1 >> 1;
                
                if(q[mid] <= x) l = mid;
                else r = mid - 1;
            }
            
            printf("%d\n", l);
            
        }
    }
    return 0;
}